Radon numbers and the fractional Helly theorem
نویسندگان
چکیده
A basic measure of the combinatorial complexity a convexity space is its Radon number. In this paper we answer question Kalai, by showing fractional Helly theorem for spaces with bounded As consequence also get weak ε-net This answers Bukh and extends recent result Moran Yehudayoff.
منابع مشابه
Berge's theorem, fractional Helly, and art galleries
In one of his early papers Claude Berge proved a Helly-type theorem, which replaces the usual “nonempty intersection” condition with a “convex union” condition. Inspired by this we prove a fractional Helly-type result, where we assume that many (d+1)-tuples of a family of convex sets have a star-shaped union, and the conclusion is that many of the sets have a common point. We also investigate s...
متن کاملA Note on Smaller Fractional Helly Numbers
Let F be a family of geometric objects in R such that the complexity (number of faces of all dimensions on the boundary) of the union of any m of them is o(m). We show that F , as well as {F ∩P | F ∈ F} for any given set P ∈ R, have fractional Helly number at most k. This improves the known bounds for fractional Helly numbers of many families.
متن کاملFractional Helly theorem for the diameter of convex sets
We provide a new quantitative version of Helly’s theorem: there exists an absolute constant α > 1 with the following property: if {Pi : i ∈ I} is a finite family of convex bodies in R with int (⋂ i∈I Pi ) 6= ∅, then there exist z ∈ R, s 6 αn and i1, . . . is ∈ I such that z + Pi1 ∩ · · · ∩ Pis ⊆ cn 3/2 ( z + ⋂
متن کاملLeray Numbers of Projections and a Topological Helly Type Theorem
Let X be a simplicial complex on the vertex set V . The rational Leray number L(X) of X is the minimal d such that H̃i(Y ;Q) = 0 for all induced subcomplexes Y ⊂ X and i ≥ d. Suppose V = ⋃m i=1 Vi is a partition of V such that the induced subcomplexes X[Vi] are all 0-dimensional. Let π denote the projection of X into the (m − 1)-simplex on the vertex set {1, . . . ,m} given by π(v) = i if v ∈ Vi...
متن کاملA fractional Helly theorem for convex lattice sets
A set of the form C-Z ; where CDR is convex and Z denotes the integer lattice, is called a convex lattice set. It is known that the Helly number of d-dimensional convex lattice sets is 2 : We prove that the fractional Helly number is only d þ 1: For every d and every aAð0; 1 there exists b40 such that whenever F1;y;Fn are convex lattice sets in Z such that T iAI Fia| for at least að n dþ1Þ inde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2021
ISSN: ['1565-8511', '0021-2172']
DOI: https://doi.org/10.1007/s11856-021-2102-8